Neighborhood unions and extremal spanning trees
نویسندگان
چکیده
منابع مشابه
Neighborhood unions and extremal spanning trees
We generalize a known suÆcient condition for the traceability of a graph to a condition for the existence of a spanning tree with a bounded number of leaves. Both of the conditions involve neighborhood unions. Further, we present two results on spanning spiders (trees with a single branching vertex). We pose a number of open questions concerning extremal spanning trees.
متن کاملComputing Generalized Minimum Spanning Trees with Variable Neighborhood Search
In the generalized version of the classical Minimum Spanning Tree problem, the nodes of a graph are partitioned into clusters and exactly one node from each cluster must be connected. This problem plays, for example, a role in the design of backbones in larger communication networks. We present a Variable Neighborhood Search (VNS) approach for this problem which is based on two different neighb...
متن کاملNeighborhood Unions and Independent Cycles
We prove that if G is a simple graph of order n ≥ 3k such that |N(x) ∪ N(y)| ≥ 3k for all nonadjacent pairs of vertices x and y, then G contains k vertex independent cycles.
متن کاملNeighborhood unions and Hamiltonian properties
Let G be a simple graph of order n with connectivity k 3 2, independence number cc We prove that if for each independent set S of cardinality k+ 1, one of the following condition holds: (1) there exist u # v in S such that d(u) +d(v) > n or ) N(u)nN(v) I> cr; (2) for any distinct pair u and u in S, )N(u)uN(v)J>,n-max{d(x))x~S}, then G is Hamiltonian. Many known results on Hamiltonian graphs are...
متن کاملNeighborhood unions and cyclability of graphs
A graph G is said to be cyclable if for each orientation → G of G, there exists a set S of vertices such that reversing all the arcs of → G with one end in S results in a hamiltonian digraph. Let G be a 3-connected graph of order n¿ 36. In this paper, we show that if for any three independent vertices x1, x2 and x3, |N (x1) ∪ N (x2)|+ |N (x2) ∪ N (x3)|+ |N (x3) ∪ N (x1)|¿ 2n+ 1, then G is cycla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.04.071